منابع مشابه
Conjugacy on partial words
The study of the combinatorial properties of strings of symbols from a finite alphabet (also referred to as words) is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics. In this paper, we examine to which extent some fundamental combinatorial properties of words, such as conjugacy, remain true for partial words. The motivation behind the notion o...
متن کاملSemiperiodic words and root-conjugacy
A factor u of a word w is called right special if there exist two distinct letters a and b such that both ua and ub are factors of w. Left special factors are de)ned symmetrically. By Rw (resp. Lw) we denote the minimal natural number such that there is no right (resp. left) special factor of w of length Rw (resp. Lw). Moreover, Hw (resp. Kw) denotes the length of the shortest pre)x (resp. su,x...
متن کاملCompatibility and Conjugacy on Partial Arrays
Research in combinatorics on words goes back a century. Berstel and Boasson introduced the partial words in the context of gene comparison. Alignment of two genes can be viewed as a construction of two partial words that are said to be compatible. In this paper, we examine to which extent the fundamental properties of partial words such as compatbility and conjugacy remain true for partial arra...
متن کاملEquations on Partial Words
It is well known that some of the most basic properties of words, like the commutativity (xy = yx) and the conjugacy (xz = zy), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution. For instance, the equation xmyn = zp has only periodic solutions in a free monoid, that is, if xmyn = zp holds with integers m,n,...
متن کاملOn universal partial words
A universal word for a finite alphabet A and some integer n ≥ 1 is a word over A such that every word in An appears exactly once as a subword (cyclically or linearly). It is well-known and easy to prove that universal words exist for any A and n. In this work we initiate the systematic study of universal partial words. These are words that in addition to the letters from A may contain an arbitr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(01)00278-x